A Simple Run-time Concurrency Measure
نویسنده
چکیده
A “concurrency measure” provides an objective means of comparing the level of parallelism achievable by a distributed computation. To date such measures have only been applicable after a computation has successfully terminated. This paper develops a notion of “observed concurrency” that can be continuously evaluated as a computation proceeds. It is suitable for nested parallelism and evaluation either in situ or during simulation.
منابع مشابه
Measuring Concurrency of Regular Distributed Computations
In this paper, we present a concurrency measure that is especially adapted to distributed programs that exhibit regular run-time behaviours. Such programs are frequently obtained by automatic parallelization of sequential code. This measure is based on the antichain lattice of the partial order that models the distributed execution under consideration. We show under which condition the measure ...
متن کاملSCOOP An Investigation of Concurrency in Eiffel
Bertrand Meyer has defined an inter-object concurrency mechanism for the Eiffel language. The mechanism, SCOOP (Simple Concurrent Object-Oriented Programming), differs significantly from the concurrency mechanisms of Java, and many other objectoriented languages. This thesis presents the mechanism described by Meyer. Its properties are considered, and a model that describes SCOOP is derived. Fr...
متن کاملEstimating Execution Time of Distributed Applications
In this work we consider the problem of estimating execution time of distributed applications. The main difficulty stems from the communication delays and shared nature of the computing and communication media. A simple method taking into account communications and concurrency of computations is proposed to estimate the execution time of a distributed application. The proposed technique is eval...
متن کاملControlled Owicki-Gries Concurrency: Reasoning about the Preemptible eChronos Embedded Operating System
We introduce a controlled concurrency framework, derived from the Owicki-Gries method, for describing a hardware interface in detail sufficient to support the modelling and verification of small, embedded operating systems (OS’s) whose run-time responsiveness is paramount. Such real-time systems run with interrupts mostly enabled, including during scheduling. That differs from many other succes...
متن کاملCIS: A Massively Concurrent Rule-Based System
Recently researchers have suggested several computational models in which, one programs by specifying large networks of simple devices. Such models are interesting because they go to the roots of concurrency the circuit level. A problem with the models is that it is unclear how to program large systems and expensive to implement many features that are taken for granted m symbolic programming la...
متن کامل